Searching in trees
نویسندگان
چکیده
منابع مشابه
Searching Game Trees in Parallel
We present a new parallel game-tree search algorithm. Our approach classifies a processor’s available work as either mandatory (necessary for the solution) or speculative (may be necessary for the solution). Due to the nature of parallel game tree search, it is not possible to keep all processors busy with mandatory work. Our algorithm ER allows potential speculative work to be dynamically orde...
متن کاملSearching Trees: An Essay
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimensions of this topic.
متن کاملSearching Informed Game Trees
Well-known algorithms for the evaluation of the minimax function in game trees are alpha-beta Knuth] and SSS* Stockman]. An improved version of SSS* is SSS-2 Pijls-1]. All these algorithms don't use any heuristic information on the game tree. In this paper the use of heuristic information is introduced into the alpha-beta and the SSS-2 algorithm. Extended versions of these algorithms are presen...
متن کاملConnected Searching of Weighted Trees
In this paper we consider the problem of connected edge searching of weighted trees. Barrière et al. claim in [Capture of an intruder by mobile agents, SPAA’02 (2002) 200-209] that there exists a polynomial-time algorithm for finding an optimal search strategy, that is, a strategy that minimizes the number of used searchers. However, due to some flaws in their algorithm, the problem turns out t...
متن کاملGraph searching , elimination trees , and
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a generalization of bandwidth to partially ordered layouts. We consider this generalization from two main viewpoints: graph searching and tree decompositions. The three graph parameters pathwidth, profile and bandwidth related to linear layouts can be defined by variants of g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.05.001